Comparing the Measured and Latent Dark Triad: Are Three Measures Better than One?
نویسندگان
چکیده
منابع مشابه
Three Heads are Better than One
Machine translation (MT) systems do not currently achieve optimal quality translation on free text, whatever translation method they employ. Our hypothesis is that the quality of MT will improve if an MT environment uses output from a variety of MT systems working on the same text. In the latest version of the Pangloss MT project, we collect the results of three translation engines typically, s...
متن کاملThe sensitivity and specificity of clinical measures of sport concussion: three tests are better than one
CONTEXT A battery of clinical measures of neurocognition, balance and symptoms has been recommended for the management of sport concussion (SC) but is based on variable evidence. OBJECTIVE To examine the sensitivity and specificity of a battery of tests to assess SC in college athletes. DESIGN Cross-sectional. SETTING Research laboratory. PATIENTS OR OTHER PARTICIPANTS Division 1 athlet...
متن کاملTwo Are Better than One?
This paper uses Markov-switching specifications to create a hybrid model with time-varying loading on each of chartist and fundamentalist approaches. The empirical data include the U.S. dollar exchange rates of four Asian tiger countries’ currencies including NTD, SGD, HKD and KOW from 1980 to 2000. Our empirical findings are consistent with the following notions. First, the forecasting perform...
متن کاملWhen two kinases are better than one
When two kinases are better than one V idal-Eychenié et al. describe how two protein kinases team up to respond to DNA damage at stalled replication forks. DNA-dependent protein kinase catalytic subunit (DNA-PKcs) promotes the repair of DNA double-strand breaks (DSBs) by nonhomologous end joining (NHEJ). The ATR kinase, on the other hand, initiates cell cycle arrest and DNA repair after recogni...
متن کاملMultiple Random Oracles Are Better Than One
We study the problem of learning k-juntas given access to examples drawn from a number of different product distributions. Thus we wish to learn a function f : {−1, 1}n → {−1, 1} that depends on k (unknown) coordinates. While the best known algorithms for the general problem of learning a k-junta require running time of n poly(n, 2), we show that given access to k different product distribution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Methods and Measurement in the Social Sciences
سال: 2011
ISSN: 2159-7855
DOI: 10.2458/v2i1.12363